Proving properties of continuous systems: qualitative simulation and temporal logic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Qualitative Simulation and Temporal Logic: Proving Properties of Continuous Systems

We demonstrate an automated method for proving statements in temporal logic about continuous systems, even in the face of incomplete knowledge. The method combines an implemented, on-they , model-checking algorithm for statements in the temporal logic CTL* 3, 4, 5] with the output of the qualitative simulation algorithm QSIM 10, 12]. Based on the QSIM Guaranteed Coverage Theorem, we prove that ...

متن کامل

Proving Properties of Continuous Systems: Qualitative Simulation and Temporal Logic

We demonstrate an automated method for proving temporal logic statements about solutions to ordinary differential equations (ODES), even in the face of an incomplete specification of the ODE. The method combines an implemented, on-the-fly, model checking algorithm for statements in the temporal logic CTL* with the output of the qualitative simulation algorithm QSIM. Based on the QSIM Guaranteed...

متن کامل

Focusing qualitative simulation using temporal logic : theoretical

We illustrate TeQsim, a qualitative simulator for continuous dynamical systems that combines the expressive power of qualitative diierential equations with temporal logic to constrain and reene the resulting predicted behaviors. Temporal logic is used to specify constraints that restrict the simulation to a region of the state space and to specify trajectories for input variables. A proposition...

متن کامل

A Temporal Logic for Proving Properties of Topologically General Executions

We present a generalization of the temporal propositional logic of linear time which is useful for stating and proving properties of the generic execution sequence of a parallel program or a non-deterministic program. The formal system we present is exactly that same as the third of three logics presented in [LS82], but we give it a di erent semantics. The models are tree models of arbitrary si...

متن کامل

Proving Properties of Actor Programs Using Temporal Logic

meth perform (message) if (ask tail isEmpty) then let value = (ask head (ask message getSelector) (ask message getParams)) in (send (ask message getReturnAddress) return (value)) else let newTag = create(Tag) in (let mess = ask message copywithTagReturnTo (newTag message) in (send tail perform (m); send (ask message getReturnaddress) returnWithReqiredReceipts(nil newTag))) ... endDef Figure 9: ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1997

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(96)00050-1